If not Turing ’ s test , then what ? Paul
نویسنده
چکیده
If it is true that good problems produce good science, then it will be worthwhile to identify good problems, and even more worthwhile to discover the attributes that make them good problems. This discovery process is necessarily empirical, so we examine several challenge problems, beginning with Turing’s famous test, and more than a dozen attributes that challenge problems might have. We are led to a contrast between research strategies — the successful “divide and conquer” strategy and the promising but largely untested “developmental” strategy — and we conclude that good challenge problems encourage the latter strategy. 1 Turing’s test: Our first challenge More than fifty years ago, Alan Turing proposed a clever test of the proposition that machines can think [7]. He wanted the proposition to be an empirical one and he particularly wanted to avoid haggling over what it means for anything to think. Turing first introduced a game in which a man and a woman engage a third person, called the interrogator, in conversation, and the interrogator tries to guess which of the two is the man and which is the woman. Then he suggests substituting a computer for one of the two: We now ask the question, “What will happen when a machine takes the part of [the man] in this game?” Will the interrogator decide wrongly as often when the game is played like this as he does when the game is played between a man and a woman? These questions replace our original, “Can machines think?” More recently, the test has taken slightly different forms. Most contemporary versions ask simply whether the interrogator can be fooled into identifying the machine as human, not necessarily a man or a woman. There are many published arguments about Turing’s paper and I want to look at three kinds of argument. One kind says, Turing’s test is irrelevant; another concerns the philosophy of machines that think; the third is methodological. 1.1 Ignore it, and maybe it will go away... Blay Whitby [8] offers this humorous history of the Turing Test: 1950 1966: A source of inspiration to all concerned with AI. 1966 1973: A distraction from some more promising avenues of AI research. 1973 1990: By now a source of distraction mainly to philosophers, rather than AI workers. 1990: Consigned to history.
منابع مشابه
If Not Turing's Test, Then What?
ence, then it will be worthwhile to identify good problems, and even more worthwhile to discover the attributes that make them good problems. This discovery process is necessarily empirical, so we examine several challenge problems, beginning with Turing’s famous test, and more than a dozen attributes that challenge problems might have. We are led to a contrast between research strategies—the s...
متن کاملBlondie24, Playing at the Edge of AI (Book Review)
Computer science has failed abysmally at producing machines which display intelligence. According to Fogel, the last 50 years of effort in artificial intelligence have been on the wrong track, leaving us no closer to the goal than when we started. The wrong track has been the attempt to make the computer imitate our behavior. Scientists striving to build an artificial intelligence load the comp...
متن کاملShould we abandon the theory theory ?
think if a human could not tell the difference between the computer’s behavior and the behavior of another human. In the standard Turing test, a human subject communicates with both another person and a computer electronically (e.g. by typing on a keyboard). The computer passes the Turing test if the subject cannot tell the computer’s communication from the human’s – if the computer can ‘fool’ ...
متن کاملAsymptotic behavior and halting probability of Turing Machines
Through a straightforward Bayesian approach we show that under some general conditions a maximum running time, namely the number of discrete steps done by a computer program during its execution, can be defined such that the probability that such program will halt after that time is smaller than any arbitrary fixed value. Consistency with known results and consequences are also discussed. 1 Int...
متن کاملTuring and Post on Computability
[Turing then gives his formal definitions and in particular says that for a real number or function on the natural numbers to be computable it must be computable by amachine that gives an output for every input.] No attempt has yet been made to show that the "computable" numbers include all numbers which would naturally be regarded as computable. All arguments which can be given are bound to be...
متن کامل